منابع مشابه
Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry
We describe computer algorithms that can enumerate and display, for a given n > 0 (in theory, of any size), all n-ominoes, niamonds, and n-hexes that can tile the plane using only rotations; these sets necessarily contain all such tiles that are fundamental domains for p4, p3, and p6 isohedral tilings. We display the outputs for small values of n. This expands on earlier work [3]. 1 Polyominoes...
متن کاملChemical Tree Enumeration Algorithms
The need to generate graphs representing chemical structures suggested the use of computer and as a consequence the delevopment of eecient enumerating algorithms. This paper considers the isomeric acyclic structures enumeration focusin on the alkane molecular family. Two new algorithms based on Reverse Search 7] 8] are presented. The main concern of this paper is to highlight the importance of ...
متن کامل2-extendability of toroidal polyhexes and Klein-bottle polyhexes
A toroidal polyhex (resp. Klein-bottle polyhex) described by a string (p, q, t) arises from a p × q-parallelogram of a hexagonal lattice by a usual torus (resp. Klein bottle) boundary identification with a torsion t. A connected graph G admitting a perfect matching is kextendable if |V(G)| ≥ 2k + 2 and any k independent edges can be extended to a perfect matching of G. In this paper, we charact...
متن کاملOn the Enumeration of Tree Decompositions
Many intractable computational problems on graphs admit tractable algorithms when applied to trees or forests. Tree decomposition extracts a tree structure from a graph by grouping nodes into bags, where each bag corresponds to a single node in of the tree. The corresponding operation on hypergraphs is that of a generalized hypertree decomposition [10], which entails a tree decomposition of the...
متن کاملExtremal Mono-q-polyhexes
A polyhex can be defined as a graph H which is obtained from the hexagonal lattice L6 of the plane by taking a cycle C in the graph of L6 and defining H to be the part of L6 in the disk bounded by C, including C. Similarly, a mono-qpolyhex, q an integer greater than 3, is obtained from the mono-q-hexagonal lattice (all faces are hexagons except one which is a q-gon, and three faces meet at each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 1970
ISSN: 0013-0915,1464-3839
DOI: 10.1017/s0013091500009135